A Note on Nordhaus-gaddum-type Inequalities for the Automorphic H-chromatic Index of Graphs
نویسنده
چکیده
ing and Indexing: Zentralblatt MATH. AUTHORS INFO ARTICLE INFO JOURNAL INFO 2 Nordhaus-Gaddum-type inequalities
منابع مشابه
Nordhaus-Gaddum type results for the Harary index of graphs
The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...
متن کاملNordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
For a graph G on n vertices with chromatic number χ(G), the Nordhaus–Gaddum inequalities state that d2 √ ne ≤ χ(G) + χ(G) ≤ n + 1, and n ≤ χ(G) · χ(G) ≤ ⌊( n+1 2 )2⌋ . Much analysis has been done to derive similar inequalities for other graph parameters, all of which are integer-valued. We determine here the optimal Nordhaus–Gaddum inequalities for the circular chromatic number and the fraction...
متن کاملThe Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs
Let k ≥ 2 be an integer, a k-decomposition (G1,G2, . . . ,Gk) of the complete graph Kn is a partition of its edge set to form k spanning subgraphs G1,G2, . . . ,Gk. In this contribution, we investigate the Nordhaus–Gaddum-type inequality of a k-decomposition of Kn for the general Zagreb index and a 2-decomposition for the Zagreb co-indices, respectively. The corresponding extremal graphs are ch...
متن کاملNordhaus-Gaddum Theorem for the Distinguishing Chromatic Number
Nordhaus and Gaddum proved, for any graph G, that χ(G) + χ(G) 6 n + 1, where χ is the chromatic number and n = |V (G)|. Finck characterized the class of graphs, which we call NG-graphs, that satisfy equality in this bound. In this paper, we provide a new characterization of NG-graphs, based on vertex degrees, which yields a new polynomial-time recognition algorithm and efficient computation of ...
متن کاملBounds on the Chroma . Tic and Achromatic Numbers of Complimentary
In the present note, exact upper bounds on the sums of chromatic and achromatic numbers of complimentary graphs are determined Which prove in particular a conjecture by Hedetniemi (1966) and imply a bound due to Nordhaus and Gaddum (1956).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016